Parallelized solution to the asymmetric travelling salesman problem using central processing unit acceleration

<p><span>Travelling salesman problem is a well researched in computer science and has many practical applications. It classified as NP-hard its exact solution can only be obtained exponential time unless P = NP. There are different variants of the travelling (TSP) this paper, asymmetric addressed since variant quite often observed real world scenarios. number heuristic approaches to which provides approximate solutions polynomial time, however paper proposes an optimal accelerated with help multi-threading-based parallelization. In order find solution, we have used held-karp algorithm involving dynamic programming reduce taken path, multi-threaded approach parallelize processing sub-problems by leveraging central unit cores (CPUs). This method extension TSP; however, shows that computationally intensive problems such asymmetic (ATSP) modern CPUs.</span></p>